Cycle regular graphs need not be transitive
نویسندگان
چکیده
منابع مشابه
Strongly regular edge-transitive graphs
In this paper, we examine the structure of vertexand edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the Classification of Finite Simple Groups) that no graph in this family has a holomorphic simple automorphism group. We also find some constraints on the parame...
متن کاملMost Regular Graphs Are Quickly R-transitive
Consider a d-regular directed graph, G, on n vertices determined by d permutations 1; : : : ; d 2 Sn. Each word, w, over the alphabet = f 1; 2; : : : ; dg determines a walk at each vertex, and these walks give rise to a permutation of the vertices (which is simply the product of the permutations). Such a word maps a distinct r-tuple of vertices, (v1; : : : ; vr) to another distinct r-tuple of v...
متن کاملSmall vertex-transitive directed strongly regular graphs
We consider directed strongly regular graphs de2ned in 1988 by Duval. All such graphs with n vertices, n6 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is pr...
متن کاملArc { Transitive Non { Cayley Graphs from Regular
We prove that the underlying graphs of p-gonal r-valent orientably regular maps are arc-transitive but non-Cayley if r 3 and p is a prime greater than r(r ? 1).
متن کاملIdentifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs
We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2 ln(|V |) + 1 where V is the set of vertices of the graph. We focus on vertex-transitive graphs for which we can compute the exact fractional solution. There are known examples of vertex-transitive graphs that re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00292-4